Binary Search Trees Parallel and Sequential Data Structures and Algorithms , 15 - 210 ( Spring 2013 )
نویسنده
چکیده
Figure 1: a binary tree Search trees are tree-based data structures that can be used to store and search for items that satisfy a total order. There are many types of search trees designed for a wide variety of purposes. Probably, the most common use is to implement sets and tables (dictionaries, mappings). As shown on right, a binary tree is a tree in which every node in the tree has at most two children. A binary search tree (BST) is a binary tree satisfying the following “search” property: for each node v, the key of the left child of v is smaller than the key of v and the key of the right child of v is bigger than the key of v; that is, for the tree in the figure on right, we have kL < k < kR. This ordering is useful navigating the tree.
منابع مشابه
A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures (Invited Paper)
Concurrent and parallel algorithms are different. However, in the case of dictionaries, both kinds of algorithms share many common points. We present a unified approach emphasizing these points. It is based on a careful analysis of the sequential algorithm, extracting from it the more basic facts, encapsulated later on as local rules. We apply the method to the insertion algorithms in AVL trees...
متن کاملOn a Sublinear Time Parallel Construction of Optimal Binary Search Trees
We design an eecient sublinear time parallel construction of optimal binary search trees. The eeciency of the parallel algorithm corresponds to its total work (the product time processors). Our algorithm works in O(n 1? log n) time with the total work O(n 2+2), for an arbitrarily small constant 0 < 1 2. This is optimal within a factor n 2 with respect to the best known sequential algorithm give...
متن کاملDynamic Programming II Parallel and Sequential Data Structures and Algorithms , 15 - 210 ( Spring 2013 )
The top-down approach is based on running the recursive code as is, generating implicitly the recursion structure from the root of the DAG down to the leaves. Each time a solution to a smaller instance is found for the first time it generates a mapping from the input argument to its solution. This way when we come across the same argument a second time we can just look up the solution. This pro...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملParallel Programming with Tree Skeletons
Parallel computing is an essential technique to deal with large scaled problems. In recent years, while hardware for parallel computing is getting widely available, developing software for parallel computing remains as a hard task for many programmers. The main difficulties are caused by the communication, synchronization, and data distribution required in parallel programs. This thesis studies...
متن کامل